#include <bits/stdc++.h>
using namespace std;
int mon[100001], n;
int main(){
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);
    scanf("%d", &n);
    for(int i=1; i<=n; i++){
        scanf("%d", &mon[i]);
    }
    sort(mon+1, mon+n+1);
    int target=0;
    for(int i=2; i<=n; i++){
        if(mon[i]>mon[target+1]){
            target++;
        }
    }
    int ans=n-target;
    printf("%d\n", ans);
    return 0;
}
